Determinism in Parallel Systems
نویسنده
چکیده
In this paper, generalizations to systems M hich are not persistent, that i\. systernc where an event can, possibly infinitelq, be postponed, are dealt with. The techniques that are used are an application of the ones published by Roasson and Nivat 1 1981)). The main result of this paper can be looked upon as a criterion for determining a determinism in systems. and is fully compatible with H-graphs (Pratt, 19761 and similar definitions of systems.
منابع مشابه
A Type and Effect System for Determinism in Multithreaded Programs
There has been much recent interest in supporting deterministic parallelism in imperative programs. Structured parallel programming models have used type systems or static analysis to enforce determinism by constraining potential interference of lexically scoped tasks. But similar support for multithreaded programming, where threads may be ubiquitously spawned with arbitrary lifetimes, especial...
متن کاملOn the Power of Deterministic and Sequential Communicating P Systems
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in either minimally or maximally parallel mode, are computationally universal. Considering the sequential mode, 2 membranes are shown to characterize the power of partially blind multicounter machines. Next, a character...
متن کاملAn Effect System and Language for Deterministic - by - Default Parallel Programming
This thesis presents a new, Java-based object-oriented parallel language called Deterministic Parallel Java (DPJ). DPJ uses a novel effect system to guarantee determinism by default. That means that parallel programs are guaranteed to execute deterministically unless nondeterminism is explicitly requested. This is in contrast to the shared-memory models in widespread use today, such as threads ...
متن کاملCOREA: A Synchronous Calculus of Parallel Communicating Reactive Automata
Reactive systems often require temporal and logical safety , concurrency and determinism. Several asynchronous or strong synchronous answers have been proposed to this problem. However, \asyn-chronous" languages such as CSP or CCS generally force the user to choose between determinism and concurrency. On the other hand, strong synchronous implementations are mainly sequential. The aim of this p...
متن کاملOn Reversibility and Determinism in P Systems
Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 26 شماره
صفحات -
تاریخ انتشار 1983